Recent attacks against HFE/Multi-HFE MQ cryptosystems and Connection with Ore’s p-polynomial decomposition
نویسندگان
چکیده
In this article we review some recent attacks against HFE and Multi-HFE cryptosystems and also a possible new direction proposed by Coulter et al. relating the security of HFE cryptosystems to the Ore’s p-polynomial decomposition algorithm.
منابع مشابه
Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
We investigate in this paper the security of HFE and Multi-HFE schemes as well as their minus and embedding variants. Multi-HFE is a generalization of the well-known HFE schemes. The idea is to use a multivariate quadratic system – instead of a univariate polynomial in HFE – over an extension field as a private key. According to the authors, this should make the classical direct algebraic (mess...
متن کاملCryptanalysis of multi-HFE
Multi-HFE (Chen et al., 2009) is one of cryptosystems whose public key is a set of multivariate quadratic forms over a finite field. Its quadratic forms are constructed by a set of multivariate quadratic forms over an extension field. Recently, Bettale et al. (2013) have studied the security of HFE and multi-HFE against the min-rank attack and found that multi-HFE is not more secure than HFE of...
متن کاملAlgebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
In this paper, we review and explain the existing algebraic cryptanalysis of multivariate cryptosystems from the hidden field equation (HFE) family. These cryptanalysis break cryptosystems in the HFE family by solving multivariate systems of equations. In this paper we present a new and efficient attack of this cryptosystem based on fast algorithms for computing Gröbner basis. In particular it ...
متن کاملHfe Based Multi - Variate Quadratic Cryptosystems
HFE BASED MULTI-VARIATE QUADRATIC CRYPTOSYSTEMS AND DEMBOWSKI OSTROM POLYNOMIALS Alam, Bilal Ph.D., Department of Cryptography Supervisor : Prof. Dr. Ferruh Özbudak Co-Supervisor : Dr. Oğuz Yayla
متن کاملKipnis-Shamir Attack on HFE Revisited
In this paper, we show that the claims in the original KipnisShamir’s attack on the HFE cryptosystems and the improved attack by Courtois that the complexity of the attacks is polynomial in terms of the number of variables are invalid. We present computer experiments and a theoretical argument using basic algebraic geometry to explain why it is so. Furthermore we show that even with the help of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013